On a class of subadditive duals for the uncapacitated facility location problem

A family of subadditive functions which contains the optimal solution of subadditive duals for integer programs has been presented by Klabjan (2007). In this paper we present a subadditive dual ascent procedure to find an optimal subadditive dual function based on Klabjan’s generator subadditive function. Then we use the proposed method to solve the so called uncapacitated facility location problem (UFLP). Establishing an explicit formulation for generator subadditive functions in the columns of the coefficient matrix of the UFLP, we derive some variable fixing rules for the problem. Some computational results are also presented.